Determination of a Good Indicator for Estimated Prime Factor and Its Modification in Fermat’s Factoring Algorithm

Fermat’s Factoring Algorithm (FFA) is an integer factorisation methods factoring the modulus N using exhaustive search. The appearance of Estimated Prime Factor (EPF) method reduces cost FFA’s loop count. However, EPF does not work for balanced primes. This paper proposed modified 1-Estimated (mFFA1-EPF) that improves method. algorithm works a with unbalanced and primes, respectively. main results mFFA1-EPF focused on three criteria: (i) approach to select good candidates from list convergent continued fraction, (ii) establishment new potential initial values based EPF, (iii) application above modification upon FFA. resulting study shows significant improvement count FFA1 via (improved) compared existing methods. can be executed without failure caters both primes factor.